Computability on subsets of Euclidean space I: closed and compact subsets
نویسندگان
چکیده
منابع مشابه
Computability on Regular Subsets of Euclidean Space
For the computability of subsets of real numbers, several reasonable notions have been suggested in the literature. We compare these notions in a systematic way by relating them to pairs of ‘basic’ ones. They turn out to coincide for full-dimensional convex sets; but on the more general class of regular sets, they reveal rather interesting ’weaker/stronger’ relations. This is in contrast to sin...
متن کاملSOME REMARKS ON GENERALIZATIONS OF MULTIPLICATIVELY CLOSED SUBSETS
Let R be a commutative ring with identity and Mbe a unitary R-module. In this paper we generalize the conceptmultiplicatively closed subset of R and we study some propertiesof these genaralized subsets of M. Among the many results in thispaper, we generalize some well-known theorems about multiplicativelyclosed subsets of R to these generalized subsets of M. Alsowe show that some other well-kno...
متن کاملOn the Asymptotic Magnitude of Subsets of Euclidean Space
‘Magnitude’ is a canonical invariant of finite metric spaces which has its origins in category theory; it is analogous to cardinality of finite sets. Here, by approximating certain compact subsets of Euclidean space with finite subsets, the magnitudes of line segments, circles and Cantor sets are defined and calculated. It is observed that asymptotically these satisfy the inclusion-exclusion pr...
متن کاملOn radii of spheres determined by subsets of Euclidean space
In this paper we consider the problem that how large the Hausdorff dimension of E ⊂ Rd needs to be to ensure the radii set of (d − 1)-dimensional spheres determined by E has positive Lebesgue measure. We obtain two results. First, by extending a general mechanism for studying Falconer-type problems in [4], we prove that it holds when dimH(E) > d− 1+ 1 d and in R2, the index 3 2 is sharp for thi...
متن کاملCompact subsets of the Baire space
Let P be the natural forcing for producing a finite splitting tree using finite conditions. Namely, p ∈ P iff p ⊆ ω is a finite subtree and p ≤ q iff p ⊇ q is an end extension of q. End extension means if s ∈ p\q then s ⊇ t for some t ∈ q which is terminal in q, i.e., has no extensions in q. This order is countable and hence forcing equivalent to adding a single Cohen real. The union of P-gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1999
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(98)00284-9